The Expected Size of the Rule k Dominating Set
نویسندگان
چکیده
منابع مشابه
The Expected Size of the Rule k Dominating Set: I
Dai, Li, and Wu [11] [30] proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the “average case”performance of Rule k for the model of random unit disk graphs constructed from n random points in an `n × `n square. We show that if k ≥ 3 and `n = o(√n), then the expected size of the Rule k dominating set...
متن کاملThe Expected Size of the Rule k Dominating Set: II
Rule k (k=1,2,3,...) is a well known family of approximation algorithms that can be used to find connected dominating sets in a graph. They were originally proposed by Dai, Li, and Wu as the basis for efficient routing methods for ad hoc wireless networks. In this paper we study the asymptotic performance of Rules 1 and 2 on random unit disk graphs formed from n random points in an `n × `n squa...
متن کاملsurvey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولGeometry of the set of dominating k-additive belief functions
In this paper we introduce a novel, simpler form of the polytope of inner Bayesian approximations of a belief function, or “consistent probabilities”. We prove that the set of vertices of this polytope is generated by all possible permutations of elements of the domain, mirroring a similar behavior of outer consonant approximations. An intriguing connection with the behavior of maximal outer co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2006
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-006-0104-x